Signal Transition Graph Constraints for Synthesis
نویسندگان
چکیده
A synthesis procedure for asynchronous control circuits from a high level speci cation, signal transition graph (STG), is described. In this paper, we propose some syntactic constraints on STG to guarantee hazard-free implementation. We have introduced a global persistency concept in order to establish the relationship between the persistency concept introduced by Chu [2] (which we call local persistency) and the consistent state coding (CSC). The STG syntactic constraints required to compute the input set of a signal are identi ed. We analyze all hazards under both single and multiple input change conditions and propose necessary changes to the net contraction and logic synthesis procedures. The proposed changes are guaranteed to generate hazard-free circuits with the unbounded-gate delay model, if the STG is live, safe and has consistent state coding.
منابع مشابه
Modeling and Synthesis of Timed Asynchronous Circuits
| Most asynchronous compilers do not take into account timing constraints, although these are crucial for industrial interface applications. In this paper we extend the classical signal transition graph model such that timing constraints can be modeled in a concise way. We also propose synthesis algorithms that transform the initial speci cation such that the circuit derived from the transforme...
متن کاملSignal Transition Graph Constraints for Synthesis of Hazard-Free Asynchronous Circuits with Unbounded-Gate Delays
A synthesis procedure for asynchronous control circuits from a high level speci cation signal transition graph STG is described In this paper we propose some syntactic constraints on STG to guarantee hazard free im plementation We have introduced a global persistency concept in order to establish the relationship between the persistency concept introduced by Chu which we call local persistency ...
متن کاملA Modular Partitioning Approach for Asynchronous Circuit Synthesis y
Asynchronous circuits are widely used in many real time applications such as digital communication and computer systems. The design of complex asynchronous circuits is a di cult and error-prone task. An adequate synthesis method will signi cantly simplify the design and reduce errors. In this paper, we present a general and e cient partitioning approach to the synthesis of asynchronous circuits...
متن کاملOn the CSC Property of Signal Transition Graph Specifications for Asynchronous Circuit Design
This paper proposes a new approach for asynchronous logic synthesis from Signal Transition Graph (STG) speci cations. The Complete State Coding (CSC) property of STGs is a necessary condition to get a circuit implementation from an STG. We present a novel method to check the CSC property of STGs. We also discuss some heuristics which automatically modify the STG so that the CSC property is sati...
متن کاملDerivation of Set and Reset Covers for gC Elements and Standard C Implementation Using STG Unfoldings
The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling edges of signals. One of the crucial problems in the synthesis of such circuits is deriving the set and reset covers for the state-holding elements implementing each output signal of the circuit. The derived covers must satisf...
متن کامل